Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unxpwdom3 Structured version   Visualization version   GIF version

Theorem unxpwdom3 37982
 Description: Weaker version of unxpwdom 8535 where a function is required only to be cancellative, not an injection. 𝐷 and 𝐵 are to be thought of as "large" "horizonal" sets, the others as "small". Because the operator is row-wise injective, but the whole row cannot inject into 𝐴, each row must hit an element of 𝐵; by column injectivity, each row can be identified in at least one way by the 𝐵 element that it hits and the column in which it is hit. (Contributed by Stefan O'Rear, 8-Jul-2015.) MOVABLE
Hypotheses
Ref Expression
unxpwdom3.av (𝜑𝐴𝑉)
unxpwdom3.bv (𝜑𝐵𝑊)
unxpwdom3.dv (𝜑𝐷𝑋)
unxpwdom3.ov ((𝜑𝑎𝐶𝑏𝐷) → (𝑎 + 𝑏) ∈ (𝐴𝐵))
unxpwdom3.lc (((𝜑𝑎𝐶) ∧ (𝑏𝐷𝑐𝐷)) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐))
unxpwdom3.rc (((𝜑𝑑𝐷) ∧ (𝑎𝐶𝑐𝐶)) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
unxpwdom3.ni (𝜑 → ¬ 𝐷𝐴)
Assertion
Ref Expression
unxpwdom3 (𝜑𝐶* (𝐷 × 𝐵))
Distinct variable groups:   𝑎,𝑏,𝑐,𝑑,𝐵   𝐶,𝑎,𝑏,𝑐,𝑑   𝐷,𝑎,𝑏,𝑐,𝑑   + ,𝑎,𝑏,𝑐,𝑑   𝜑,𝑎,𝑏,𝑐,𝑑   𝐴,𝑏,𝑐
Allowed substitution hints:   𝐴(𝑎,𝑑)   𝑉(𝑎,𝑏,𝑐,𝑑)   𝑊(𝑎,𝑏,𝑐,𝑑)   𝑋(𝑎,𝑏,𝑐,𝑑)

Proof of Theorem unxpwdom3
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unxpwdom3.dv . . 3 (𝜑𝐷𝑋)
2 unxpwdom3.bv . . 3 (𝜑𝐵𝑊)
3 xpexg 7002 . . 3 ((𝐷𝑋𝐵𝑊) → (𝐷 × 𝐵) ∈ V)
41, 2, 3syl2anc 694 . 2 (𝜑 → (𝐷 × 𝐵) ∈ V)
5 simprr 811 . . . . 5 (((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → (𝑎 + 𝑑) ∈ 𝐵)
6 simplr 807 . . . . . . 7 (((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → 𝑎𝐶)
7 unxpwdom3.rc . . . . . . . . . 10 (((𝜑𝑑𝐷) ∧ (𝑎𝐶𝑐𝐶)) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
87an4s 886 . . . . . . . . 9 (((𝜑𝑎𝐶) ∧ (𝑑𝐷𝑐𝐶)) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
98anassrs 681 . . . . . . . 8 ((((𝜑𝑎𝐶) ∧ 𝑑𝐷) ∧ 𝑐𝐶) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
109adantlrr 757 . . . . . . 7 ((((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) ∧ 𝑐𝐶) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
116, 10riota5 6677 . . . . . 6 (((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → (𝑐𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)) = 𝑎)
1211eqcomd 2657 . . . . 5 (((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)))
13 eqeq2 2662 . . . . . . . 8 (𝑦 = (𝑎 + 𝑑) → ((𝑐 + 𝑑) = 𝑦 ↔ (𝑐 + 𝑑) = (𝑎 + 𝑑)))
1413riotabidv 6653 . . . . . . 7 (𝑦 = (𝑎 + 𝑑) → (𝑐𝐶 (𝑐 + 𝑑) = 𝑦) = (𝑐𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)))
1514eqeq2d 2661 . . . . . 6 (𝑦 = (𝑎 + 𝑑) → (𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦) ↔ 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑))))
1615rspcev 3340 . . . . 5 (((𝑎 + 𝑑) ∈ 𝐵𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑))) → ∃𝑦𝐵 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦))
175, 12, 16syl2anc 694 . . . 4 (((𝜑𝑎𝐶) ∧ (𝑑𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → ∃𝑦𝐵 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦))
18 unxpwdom3.ni . . . . . . 7 (𝜑 → ¬ 𝐷𝐴)
1918adantr 480 . . . . . 6 ((𝜑𝑎𝐶) → ¬ 𝐷𝐴)
20 unxpwdom3.av . . . . . . . 8 (𝜑𝐴𝑉)
2120ad2antrr 762 . . . . . . 7 (((𝜑𝑎𝐶) ∧ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → 𝐴𝑉)
22 oveq2 6698 . . . . . . . . . . . . . 14 (𝑑 = 𝑏 → (𝑎 + 𝑑) = (𝑎 + 𝑏))
2322eleq1d 2715 . . . . . . . . . . . . 13 (𝑑 = 𝑏 → ((𝑎 + 𝑑) ∈ 𝐵 ↔ (𝑎 + 𝑏) ∈ 𝐵))
2423notbid 307 . . . . . . . . . . . 12 (𝑑 = 𝑏 → (¬ (𝑎 + 𝑑) ∈ 𝐵 ↔ ¬ (𝑎 + 𝑏) ∈ 𝐵))
2524rspcv 3336 . . . . . . . . . . 11 (𝑏𝐷 → (∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → ¬ (𝑎 + 𝑏) ∈ 𝐵))
2625adantl 481 . . . . . . . . . 10 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → (∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → ¬ (𝑎 + 𝑏) ∈ 𝐵))
27 unxpwdom3.ov . . . . . . . . . . . . . 14 ((𝜑𝑎𝐶𝑏𝐷) → (𝑎 + 𝑏) ∈ (𝐴𝐵))
28273expa 1284 . . . . . . . . . . . . 13 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → (𝑎 + 𝑏) ∈ (𝐴𝐵))
29 elun 3786 . . . . . . . . . . . . 13 ((𝑎 + 𝑏) ∈ (𝐴𝐵) ↔ ((𝑎 + 𝑏) ∈ 𝐴 ∨ (𝑎 + 𝑏) ∈ 𝐵))
3028, 29sylib 208 . . . . . . . . . . . 12 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → ((𝑎 + 𝑏) ∈ 𝐴 ∨ (𝑎 + 𝑏) ∈ 𝐵))
3130orcomd 402 . . . . . . . . . . 11 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → ((𝑎 + 𝑏) ∈ 𝐵 ∨ (𝑎 + 𝑏) ∈ 𝐴))
3231ord 391 . . . . . . . . . 10 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → (¬ (𝑎 + 𝑏) ∈ 𝐵 → (𝑎 + 𝑏) ∈ 𝐴))
3326, 32syld 47 . . . . . . . . 9 (((𝜑𝑎𝐶) ∧ 𝑏𝐷) → (∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → (𝑎 + 𝑏) ∈ 𝐴))
3433impancom 455 . . . . . . . 8 (((𝜑𝑎𝐶) ∧ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → (𝑏𝐷 → (𝑎 + 𝑏) ∈ 𝐴))
35 unxpwdom3.lc . . . . . . . . . 10 (((𝜑𝑎𝐶) ∧ (𝑏𝐷𝑐𝐷)) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐))
3635ex 449 . . . . . . . . 9 ((𝜑𝑎𝐶) → ((𝑏𝐷𝑐𝐷) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐)))
3736adantr 480 . . . . . . . 8 (((𝜑𝑎𝐶) ∧ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → ((𝑏𝐷𝑐𝐷) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐)))
3834, 37dom2d 8038 . . . . . . 7 (((𝜑𝑎𝐶) ∧ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → (𝐴𝑉𝐷𝐴))
3921, 38mpd 15 . . . . . 6 (((𝜑𝑎𝐶) ∧ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → 𝐷𝐴)
4019, 39mtand 692 . . . . 5 ((𝜑𝑎𝐶) → ¬ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵)
41 dfrex2 3025 . . . . 5 (∃𝑑𝐷 (𝑎 + 𝑑) ∈ 𝐵 ↔ ¬ ∀𝑑𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵)
4240, 41sylibr 224 . . . 4 ((𝜑𝑎𝐶) → ∃𝑑𝐷 (𝑎 + 𝑑) ∈ 𝐵)
4317, 42reximddv 3047 . . 3 ((𝜑𝑎𝐶) → ∃𝑑𝐷𝑦𝐵 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦))
44 vex 3234 . . . . . . . . 9 𝑑 ∈ V
45 vex 3234 . . . . . . . . 9 𝑦 ∈ V
4644, 45op1std 7220 . . . . . . . 8 (𝑥 = ⟨𝑑, 𝑦⟩ → (1st𝑥) = 𝑑)
4746oveq2d 6706 . . . . . . 7 (𝑥 = ⟨𝑑, 𝑦⟩ → (𝑐 + (1st𝑥)) = (𝑐 + 𝑑))
4844, 45op2ndd 7221 . . . . . . 7 (𝑥 = ⟨𝑑, 𝑦⟩ → (2nd𝑥) = 𝑦)
4947, 48eqeq12d 2666 . . . . . 6 (𝑥 = ⟨𝑑, 𝑦⟩ → ((𝑐 + (1st𝑥)) = (2nd𝑥) ↔ (𝑐 + 𝑑) = 𝑦))
5049riotabidv 6653 . . . . 5 (𝑥 = ⟨𝑑, 𝑦⟩ → (𝑐𝐶 (𝑐 + (1st𝑥)) = (2nd𝑥)) = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦))
5150eqeq2d 2661 . . . 4 (𝑥 = ⟨𝑑, 𝑦⟩ → (𝑎 = (𝑐𝐶 (𝑐 + (1st𝑥)) = (2nd𝑥)) ↔ 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦)))
5251rexxp 5297 . . 3 (∃𝑥 ∈ (𝐷 × 𝐵)𝑎 = (𝑐𝐶 (𝑐 + (1st𝑥)) = (2nd𝑥)) ↔ ∃𝑑𝐷𝑦𝐵 𝑎 = (𝑐𝐶 (𝑐 + 𝑑) = 𝑦))
5343, 52sylibr 224 . 2 ((𝜑𝑎𝐶) → ∃𝑥 ∈ (𝐷 × 𝐵)𝑎 = (𝑐𝐶 (𝑐 + (1st𝑥)) = (2nd𝑥)))
544, 53wdomd 8527 1 (𝜑𝐶* (𝐷 × 𝐵))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 382   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030  ∀wral 2941  ∃wrex 2942  Vcvv 3231   ∪ cun 3605  ⟨cop 4216   class class class wbr 4685   × cxp 5141  ‘cfv 5926  ℩crio 6650  (class class class)co 6690  1st c1st 7208  2nd c2nd 7209   ≼ cdom 7995   ≼* cwdom 8503 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-1st 7210  df-2nd 7211  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-wdom 8505 This theorem is referenced by:  isnumbasgrplem2  37991
 Copyright terms: Public domain W3C validator