Theorem oaordex 8483

Description: Existence theorem for ordering of ordinal sum. Similar to Proposition 4.34(f) of [Mendelson] p. 266 and its converse. (Contributed by NM, 12-Dec-2004.)

Assertion

Ref	Expression
oaordex	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem oaordex

Step	Hyp	Ref	Expression
1		onelss 6352	. . . . 5 ⊢ (𝐵 ∈ On → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
2	1	adantl 482	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
3		oawordex 8482	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ On (𝐴 +o 𝑥) = 𝐵))
4	2, 3	sylibd 240	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 → ∃𝑥 ∈ On (𝐴 +o 𝑥) = 𝐵))
5		oaord1 8476	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (∅ ∈ 𝑥 ↔ 𝐴 ∈ (𝐴 +o 𝑥)))
6		eleq2 2828	. . . . . . . . . . . . 13 ⊢ ((𝐴 +o 𝑥) = 𝐵 → (𝐴 ∈ (𝐴 +o 𝑥) ↔ 𝐴 ∈ 𝐵))
7	5, 6	sylan9bb 514	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝑥 ∈ On) ∧ (𝐴 +o 𝑥) = 𝐵) → (∅ ∈ 𝑥 ↔ 𝐴 ∈ 𝐵))
8	7	biimprcd 251	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝐵 → (((𝐴 ∈ On ∧ 𝑥 ∈ On) ∧ (𝐴 +o 𝑥) = 𝐵) → ∅ ∈ 𝑥))
9	8	exp4c 433	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ On → (𝑥 ∈ On → ((𝐴 +o 𝑥) = 𝐵 → ∅ ∈ 𝑥))))
10	9	com12 32	. . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝐴 ∈ 𝐵 → (𝑥 ∈ On → ((𝐴 +o 𝑥) = 𝐵 → ∅ ∈ 𝑥))))
11	10	imp4b 422	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐴 ∈ 𝐵) → ((𝑥 ∈ On ∧ (𝐴 +o 𝑥) = 𝐵) → ∅ ∈ 𝑥))
12		simpr 485	. . . . . . . 8 ⊢ ((𝑥 ∈ On ∧ (𝐴 +o 𝑥) = 𝐵) → (𝐴 +o 𝑥) = 𝐵)
13	11, 12	jca2 518	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐴 ∈ 𝐵) → ((𝑥 ∈ On ∧ (𝐴 +o 𝑥) = 𝐵) → (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
14	13	expd 416	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐴 ∈ 𝐵) → (𝑥 ∈ On → ((𝐴 +o 𝑥) = 𝐵 → (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))))
15	14	reximdvai 3150	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐴 ∈ 𝐵) → (∃𝑥 ∈ On (𝐴 +o 𝑥) = 𝐵 → ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
16	15	ex 413	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 ∈ 𝐵 → (∃𝑥 ∈ On (𝐴 +o 𝑥) = 𝐵 → ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))))
17	16	adantr 481	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 → (∃𝑥 ∈ On (𝐴 +o 𝑥) = 𝐵 → ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))))
18	4, 17	mpdd 43	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 → ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
19	7	biimpd 230	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝑥 ∈ On) ∧ (𝐴 +o 𝑥) = 𝐵) → (∅ ∈ 𝑥 → 𝐴 ∈ 𝐵))
20	19	exp31 420	. . . . . 6 ⊢ (𝐴 ∈ On → (𝑥 ∈ On → ((𝐴 +o 𝑥) = 𝐵 → (∅ ∈ 𝑥 → 𝐴 ∈ 𝐵))))
21	20	com34 91	. . . . 5 ⊢ (𝐴 ∈ On → (𝑥 ∈ On → (∅ ∈ 𝑥 → ((𝐴 +o 𝑥) = 𝐵 → 𝐴 ∈ 𝐵))))
22	21	imp4a 423	. . . 4 ⊢ (𝐴 ∈ On → (𝑥 ∈ On → ((∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → 𝐴 ∈ 𝐵)))
23	22	rexlimdv 3138	. . 3 ⊢ (𝐴 ∈ On → (∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → 𝐴 ∈ 𝐵))
24	23	adantr 481	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → 𝐴 ∈ 𝐵))
25	18, 24	impbid 213	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ On (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∃wrex 3063   ⊆ wss 3883  ∅c0 4261  Oncon0 6310  (class class class)co 7356   +_o coa 8392

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-oadd 8399

This theorem is referenced by: (None)