Theorem pm54.43 10070

Description: Theorem *54.43 of [WhiteheadRussell] p. 360. "From this proposition it will follow, when arithmetical addition has been defined, that 1+1=2." See http://en.wikipedia.org/wiki/Principia_Mathematica#Quotations. This theorem states that two sets of cardinality 1 are disjoint iff their union has cardinality 2.

Whitehead and Russell define 1 as the collection of all sets with cardinality 1 (i.e. all singletons; see card1 10037), so that their 𝐴 ∈ 1 means, in our notation, 𝐴 ∈ {𝑥 ∣ (card‘𝑥) = 1_o} which is the same as 𝐴 ≈ 1_o by pm54.43lem 10069. We do not have several of their earlier lemmas available (which would otherwise be unused by our different approach to arithmetic), so our proof is longer. (It is also longer because we must show every detail.)

Theorem dju1p1e2 10243 shows the derivation of 1+1=2 for cardinal numbers from this theorem. (Contributed by NM, 4-Apr-2007.)

Assertion

Ref	Expression
pm54.43	⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ 1o) → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐴 ∪ 𝐵) ≈ 2o))

Proof of Theorem pm54.43

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1oex 8532	. . . . . . 7 ⊢ 1o ∈ V
2	1	ensn1 9082	. . . . . 6 ⊢ {1o} ≈ 1o
3	2	ensymi 9064	. . . . 5 ⊢ 1o ≈ {1o}
4		entr 9066	. . . . 5 ⊢ ((𝐵 ≈ 1o ∧ 1o ≈ {1o}) → 𝐵 ≈ {1o})
5	3, 4	mpan2 690	. . . 4 ⊢ (𝐵 ≈ 1o → 𝐵 ≈ {1o})
6		1on 8534	. . . . . . . 8 ⊢ 1o ∈ On
7	6	onirri 6508	. . . . . . 7 ⊢ ¬ 1o ∈ 1o
8		disjsn 4736	. . . . . . 7 ⊢ ((1o ∩ {1o}) = ∅ ↔ ¬ 1o ∈ 1o)
9	7, 8	mpbir 231	. . . . . 6 ⊢ (1o ∩ {1o}) = ∅
10		unen 9112	. . . . . 6 ⊢ (((𝐴 ≈ 1o ∧ 𝐵 ≈ {1o}) ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ (1o ∩ {1o}) = ∅)) → (𝐴 ∪ 𝐵) ≈ (1o ∪ {1o}))
11	9, 10	mpanr2 703	. . . . 5 ⊢ (((𝐴 ≈ 1o ∧ 𝐵 ≈ {1o}) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∪ 𝐵) ≈ (1o ∪ {1o}))
12	11	ex 412	. . . 4 ⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ {1o}) → ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∪ 𝐵) ≈ (1o ∪ {1o})))
13	5, 12	sylan2 592	. . 3 ⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ 1o) → ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∪ 𝐵) ≈ (1o ∪ {1o})))
14		df-2o 8523	. . . . 5 ⊢ 2o = suc 1o
15		df-suc 6401	. . . . 5 ⊢ suc 1o = (1o ∪ {1o})
16	14, 15	eqtri 2768	. . . 4 ⊢ 2o = (1o ∪ {1o})
17	16	breq2i 5174	. . 3 ⊢ ((𝐴 ∪ 𝐵) ≈ 2o ↔ (𝐴 ∪ 𝐵) ≈ (1o ∪ {1o}))
18	13, 17	imbitrrdi 252	. 2 ⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ 1o) → ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ∪ 𝐵) ≈ 2o))
19		en1 9086	. . 3 ⊢ (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})
20		en1 9086	. . 3 ⊢ (𝐵 ≈ 1o ↔ ∃𝑦 𝐵 = {𝑦})
21		sneq 4658	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
22	21	uneq2d 4191	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ {𝑥}) = ({𝑥} ∪ {𝑦}))
23		unidm 4180	. . . . . . . . . . . . . 14 ⊢ ({𝑥} ∪ {𝑥}) = {𝑥}
24	22, 23	eqtr3di 2795	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ {𝑦}) = {𝑥})
25		vex 3492	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ∈ V
26	25	ensn1 9082	. . . . . . . . . . . . . 14 ⊢ {𝑥} ≈ 1o
27		1sdom2 9303	. . . . . . . . . . . . . 14 ⊢ 1o ≺ 2o
28		ensdomtr 9179	. . . . . . . . . . . . . 14 ⊢ (({𝑥} ≈ 1o ∧ 1o ≺ 2o) → {𝑥} ≺ 2o)
29	26, 27, 28	mp2an 691	. . . . . . . . . . . . 13 ⊢ {𝑥} ≺ 2o
30	24, 29	eqbrtrdi 5205	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ {𝑦}) ≺ 2o)
31		sdomnen 9041	. . . . . . . . . . . 12 ⊢ (({𝑥} ∪ {𝑦}) ≺ 2o → ¬ ({𝑥} ∪ {𝑦}) ≈ 2o)
32	30, 31	syl 17	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ¬ ({𝑥} ∪ {𝑦}) ≈ 2o)
33	32	necon2ai 2976	. . . . . . . . . 10 ⊢ (({𝑥} ∪ {𝑦}) ≈ 2o → 𝑥 ≠ 𝑦)
34		disjsn2 4737	. . . . . . . . . 10 ⊢ (𝑥 ≠ 𝑦 → ({𝑥} ∩ {𝑦}) = ∅)
35	33, 34	syl 17	. . . . . . . . 9 ⊢ (({𝑥} ∪ {𝑦}) ≈ 2o → ({𝑥} ∩ {𝑦}) = ∅)
36	35	a1i 11	. . . . . . . 8 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → (({𝑥} ∪ {𝑦}) ≈ 2o → ({𝑥} ∩ {𝑦}) = ∅))
37		uneq12 4186	. . . . . . . . 9 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → (𝐴 ∪ 𝐵) = ({𝑥} ∪ {𝑦}))
38	37	breq1d 5176	. . . . . . . 8 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → ((𝐴 ∪ 𝐵) ≈ 2o ↔ ({𝑥} ∪ {𝑦}) ≈ 2o))
39		ineq12 4236	. . . . . . . . 9 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → (𝐴 ∩ 𝐵) = ({𝑥} ∩ {𝑦}))
40	39	eqeq1d 2742	. . . . . . . 8 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → ((𝐴 ∩ 𝐵) = ∅ ↔ ({𝑥} ∩ {𝑦}) = ∅))
41	36, 38, 40	3imtr4d 294	. . . . . . 7 ⊢ ((𝐴 = {𝑥} ∧ 𝐵 = {𝑦}) → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅))
42	41	ex 412	. . . . . 6 ⊢ (𝐴 = {𝑥} → (𝐵 = {𝑦} → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅)))
43	42	exlimdv 1932	. . . . 5 ⊢ (𝐴 = {𝑥} → (∃𝑦 𝐵 = {𝑦} → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅)))
44	43	exlimiv 1929	. . . 4 ⊢ (∃𝑥 𝐴 = {𝑥} → (∃𝑦 𝐵 = {𝑦} → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅)))
45	44	imp 406	. . 3 ⊢ ((∃𝑥 𝐴 = {𝑥} ∧ ∃𝑦 𝐵 = {𝑦}) → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅))
46	19, 20, 45	syl2anb 597	. 2 ⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ 1o) → ((𝐴 ∪ 𝐵) ≈ 2o → (𝐴 ∩ 𝐵) = ∅))
47	18, 46	impbid 212	1 ⊢ ((𝐴 ≈ 1o ∧ 𝐵 ≈ 1o) → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐴 ∪ 𝐵) ≈ 2o))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108   ≠ wne 2946   ∪ cun 3974   ∩ cin 3975  ∅c0 4352  {csn 4648   class class class wbr 5166  suc csuc 6397  1_oc1o 8515  2_oc2o 8516   ≈ cen 9000   ≺ csdm 9002

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-1o 8522  df-2o 8523  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006

This theorem is referenced by:  pr2nelemOLD  10072  dju1p1e2  10243