Theorem unxpwdom3 40920

Description: Weaker version of unxpwdom 9348 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.

Step	Hyp	Ref	Expression
1		unxpwdom3.dv	. . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
2		unxpwdom3.bv	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
3	1, 2	xpexd 7601	. 2 ⊢ (𝜑 → (𝐷 × 𝐵) ∈ V)
4		simprr 770	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → (𝑎 + 𝑑) ∈ 𝐵)
5		simplr 766	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → 𝑎 ∈ 𝐶)
6		unxpwdom3.rc	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝐷) ∧ (𝑎 ∈ 𝐶 ∧ 𝑐 ∈ 𝐶)) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
7	6	an4s 657	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ 𝑐 ∈ 𝐶)) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
8	7	anassrs 468	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑑 ∈ 𝐷) ∧ 𝑐 ∈ 𝐶) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
9	8	adantlrr 718	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) ∧ 𝑐 ∈ 𝐶) → ((𝑐 + 𝑑) = (𝑎 + 𝑑) ↔ 𝑐 = 𝑎))
10	5, 9	riota5 7262	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)) = 𝑎)
11	10	eqcomd 2744	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)))
12		eqeq2 2750	. . . . . . 7 ⊢ (𝑦 = (𝑎 + 𝑑) → ((𝑐 + 𝑑) = 𝑦 ↔ (𝑐 + 𝑑) = (𝑎 + 𝑑)))
13	12	riotabidv 7234	. . . . . 6 ⊢ (𝑦 = (𝑎 + 𝑑) → (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦) = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑)))
14	13	rspceeqv 3575	. . . . 5 ⊢ (((𝑎 + 𝑑) ∈ 𝐵 ∧ 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = (𝑎 + 𝑑))) → ∃𝑦 ∈ 𝐵 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦))
15	4, 11, 14	syl2anc 584	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑑 ∈ 𝐷 ∧ (𝑎 + 𝑑) ∈ 𝐵)) → ∃𝑦 ∈ 𝐵 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦))
16		unxpwdom3.ni	. . . . . . 7 ⊢ (𝜑 → ¬ 𝐷 ≼ 𝐴)
17	16	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ¬ 𝐷 ≼ 𝐴)
18		unxpwdom3.av	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
19	18	ad2antrr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → 𝐴 ∈ 𝑉)
20		oveq2 7283	. . . . . . . . . . . . . 14 ⊢ (𝑑 = 𝑏 → (𝑎 + 𝑑) = (𝑎 + 𝑏))
21	20	eleq1d 2823	. . . . . . . . . . . . 13 ⊢ (𝑑 = 𝑏 → ((𝑎 + 𝑑) ∈ 𝐵 ↔ (𝑎 + 𝑏) ∈ 𝐵))
22	21	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑑 = 𝑏 → (¬ (𝑎 + 𝑑) ∈ 𝐵 ↔ ¬ (𝑎 + 𝑏) ∈ 𝐵))
23	22	rspcv 3557	. . . . . . . . . . 11 ⊢ (𝑏 ∈ 𝐷 → (∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → ¬ (𝑎 + 𝑏) ∈ 𝐵))
24	23	adantl 482	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → (∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → ¬ (𝑎 + 𝑏) ∈ 𝐵))
25		unxpwdom3.ov	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶 ∧ 𝑏 ∈ 𝐷) → (𝑎 + 𝑏) ∈ (𝐴 ∪ 𝐵))
26	25	3expa 1117	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → (𝑎 + 𝑏) ∈ (𝐴 ∪ 𝐵))
27		elun 4083	. . . . . . . . . . . . 13 ⊢ ((𝑎 + 𝑏) ∈ (𝐴 ∪ 𝐵) ↔ ((𝑎 + 𝑏) ∈ 𝐴 ∨ (𝑎 + 𝑏) ∈ 𝐵))
28	26, 27	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → ((𝑎 + 𝑏) ∈ 𝐴 ∨ (𝑎 + 𝑏) ∈ 𝐵))
29	28	orcomd 868	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → ((𝑎 + 𝑏) ∈ 𝐵 ∨ (𝑎 + 𝑏) ∈ 𝐴))
30	29	ord 861	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → (¬ (𝑎 + 𝑏) ∈ 𝐵 → (𝑎 + 𝑏) ∈ 𝐴))
31	24, 30	syld 47	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ 𝑏 ∈ 𝐷) → (∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵 → (𝑎 + 𝑏) ∈ 𝐴))
32	31	impancom 452	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → (𝑏 ∈ 𝐷 → (𝑎 + 𝑏) ∈ 𝐴))
33		unxpwdom3.lc	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ (𝑏 ∈ 𝐷 ∧ 𝑐 ∈ 𝐷)) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐))
34	33	ex 413	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ((𝑏 ∈ 𝐷 ∧ 𝑐 ∈ 𝐷) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐)))
35	34	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → ((𝑏 ∈ 𝐷 ∧ 𝑐 ∈ 𝐷) → ((𝑎 + 𝑏) = (𝑎 + 𝑐) ↔ 𝑏 = 𝑐)))
36	32, 35	dom2d 8781	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → (𝐴 ∈ 𝑉 → 𝐷 ≼ 𝐴))
37	19, 36	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐶) ∧ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵) → 𝐷 ≼ 𝐴)
38	17, 37	mtand 813	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ¬ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵)
39		dfrex2 3170	. . . . 5 ⊢ (∃𝑑 ∈ 𝐷 (𝑎 + 𝑑) ∈ 𝐵 ↔ ¬ ∀𝑑 ∈ 𝐷 ¬ (𝑎 + 𝑑) ∈ 𝐵)
40	38, 39	sylibr 233	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ∃𝑑 ∈ 𝐷 (𝑎 + 𝑑) ∈ 𝐵)
41	15, 40	reximddv 3204	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ∃𝑑 ∈ 𝐷 ∃𝑦 ∈ 𝐵 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦))
42		vex 3436	. . . . . . . . 9 ⊢ 𝑑 ∈ V
43		vex 3436	. . . . . . . . 9 ⊢ 𝑦 ∈ V
44	42, 43	op1std 7841	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → (1st ‘𝑥) = 𝑑)
45	44	oveq2d 7291	. . . . . . 7 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → (𝑐 + (1st ‘𝑥)) = (𝑐 + 𝑑))
46	42, 43	op2ndd 7842	. . . . . . 7 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → (2nd ‘𝑥) = 𝑦)
47	45, 46	eqeq12d 2754	. . . . . 6 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → ((𝑐 + (1st ‘𝑥)) = (2nd ‘𝑥) ↔ (𝑐 + 𝑑) = 𝑦))
48	47	riotabidv 7234	. . . . 5 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → (℩𝑐 ∈ 𝐶 (𝑐 + (1st ‘𝑥)) = (2nd ‘𝑥)) = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦))
49	48	eqeq2d 2749	. . . 4 ⊢ (𝑥 = ⟨𝑑, 𝑦⟩ → (𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + (1st ‘𝑥)) = (2nd ‘𝑥)) ↔ 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦)))
50	49	rexxp 5751	. . 3 ⊢ (∃𝑥 ∈ (𝐷 × 𝐵)𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + (1st ‘𝑥)) = (2nd ‘𝑥)) ↔ ∃𝑑 ∈ 𝐷 ∃𝑦 ∈ 𝐵 𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + 𝑑) = 𝑦))
51	41, 50	sylibr 233	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐶) → ∃𝑥 ∈ (𝐷 × 𝐵)𝑎 = (℩𝑐 ∈ 𝐶 (𝑐 + (1st ‘𝑥)) = (2nd ‘𝑥)))
52	3, 51	wdomd 9340	1 ⊢ (𝜑 → 𝐶 ≼* (𝐷 × 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065  Vcvv 3432   ∪ cun 3885  ⟨cop 4567   class class class wbr 5074   × cxp 5587  ‘cfv 6433  ℩crio 7231  (class class class)co 7275  1^st c1st 7829  2^nd c2nd 7830   ≼ cdom 8731   ≼^* cwdom 9323

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-1st 7831  df-2nd 7832  df-en 8734  df-dom 8735  df-sdom 8736  df-wdom 9324

This theorem is referenced by:  isnumbasgrplem2  40929