Theorem oacomf1o 8174

Description: Define a bijection from 𝐴 +_o 𝐵 to 𝐵 +_o 𝐴. Thus, the two are equinumerous even if they are not equal (which sometimes occurs, e.g., oancom 9098). (Contributed by Mario Carneiro, 30-May-2015.)

Hypothesis

Ref	Expression
oacomf1o.1	⊢ 𝐹 = ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))

Assertion

Ref	Expression
oacomf1o	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem oacomf1o

Step	Hyp	Ref	Expression
1		eqid 2798	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))
2	1	oacomf1olem 8173	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅))
3	2	simpld 498	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)))
4		eqid 2798	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))
5	4	oacomf1olem 8173	. . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅))
6	5	ancoms 462	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅))
7	6	simpld 498	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))
8		f1ocnv 6602	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) → ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto→𝐵)
9	7, 8	syl 17	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto→𝐵)
10		incom 4128	. . . . . 6 ⊢ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴)
11	6	simprd 499	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)
12	10, 11	syl5eq 2845	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅)
13	2	simprd 499	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅)
14		f1oun 6609	. . . . 5 ⊢ ((((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∧ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto→𝐵) ∧ ((𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅ ∧ (ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅)) → ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
15	3, 9, 12, 13, 14	syl22anc 837	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
16		oacomf1o.1	. . . . 5 ⊢ 𝐹 = ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))
17		f1oeq1 6579	. . . . 5 ⊢ (𝐹 = ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) → (𝐹:(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
18	16, 17	ax-mp 5	. . . 4 ⊢ (𝐹:(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ ((𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ ◡(𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
19	15, 18	sylibr 237	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
20		oarec 8171	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))))
21	20	f1oeq2d 6586	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ 𝐹:(𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
22	19, 21	mpbird 260	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
23		oarec 8171	. . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))))
24	23	ancoms 462	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))))
25		uncom 4080	. . . 4 ⊢ (𝐵 ∪ ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))) = (ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)
26	24, 25	eqtrdi 2849	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
27	26	f1oeq3d 6587	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴) ↔ 𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
28	22, 27	mpbird 260	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ∪ cun 3879   ∩ cin 3880  ∅c0 4243   ↦ cmpt 5110  ^◡ccnv 5518  ran crn 5520  Oncon0 6159  –1-1-onto→wf1o 6323  (class class class)co 7135   +_o coa 8082

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-oadd 8089

This theorem is referenced by:  cnfcomlem  9146