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

Theorem wepwso 37439
 Description: A well-ordering induces a strict ordering on the power set. EDITORIAL: when well-orderings are set like, this can be strengthened to remove 𝐴 ∈ 𝑉. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypothesis
Ref Expression
wepwso.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑧𝑦 ∧ ¬ 𝑧𝑥) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑤𝑥𝑤𝑦)))}
Assertion
Ref Expression
wepwso ((𝐴𝑉𝑅 We 𝐴) → 𝑇 Or 𝒫 𝐴)
Distinct variable groups:   𝑥,𝑅,𝑦,𝑧,𝑤   𝑥,𝐴,𝑦,𝑧,𝑤
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑧,𝑤)   𝑉(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem wepwso
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 2onn 7717 . . . . 5 2𝑜 ∈ ω
2 nnord 7070 . . . . 5 (2𝑜 ∈ ω → Ord 2𝑜)
31, 2ax-mp 5 . . . 4 Ord 2𝑜
4 ordwe 5734 . . . 4 (Ord 2𝑜 → E We 2𝑜)
5 weso 5103 . . . 4 ( E We 2𝑜 → E Or 2𝑜)
63, 4, 5mp2b 10 . . 3 E Or 2𝑜
7 eqid 2621 . . . 4 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
87wemapso 8453 . . 3 ((𝐴𝑉𝑅 We 𝐴 ∧ E Or 2𝑜) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} Or (2𝑜𝑚 𝐴))
96, 8mp3an3 1412 . 2 ((𝐴𝑉𝑅 We 𝐴) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} Or (2𝑜𝑚 𝐴))
10 elex 3210 . . . 4 (𝐴𝑉𝐴 ∈ V)
11 wepwso.t . . . . 5 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑧𝑦 ∧ ¬ 𝑧𝑥) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑤𝑥𝑤𝑦)))}
12 eqid 2621 . . . . 5 (𝑎 ∈ (2𝑜𝑚 𝐴) ↦ (𝑎 “ {1𝑜})) = (𝑎 ∈ (2𝑜𝑚 𝐴) ↦ (𝑎 “ {1𝑜}))
1311, 7, 12wepwsolem 37438 . . . 4 (𝐴 ∈ V → (𝑎 ∈ (2𝑜𝑚 𝐴) ↦ (𝑎 “ {1𝑜})) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}, 𝑇((2𝑜𝑚 𝐴), 𝒫 𝐴))
14 isoso 6595 . . . 4 ((𝑎 ∈ (2𝑜𝑚 𝐴) ↦ (𝑎 “ {1𝑜})) Isom {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}, 𝑇((2𝑜𝑚 𝐴), 𝒫 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} Or (2𝑜𝑚 𝐴) ↔ 𝑇 Or 𝒫 𝐴))
1510, 13, 143syl 18 . . 3 (𝐴𝑉 → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} Or (2𝑜𝑚 𝐴) ↔ 𝑇 Or 𝒫 𝐴))
1615adantr 481 . 2 ((𝐴𝑉𝑅 We 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧) E (𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))} Or (2𝑜𝑚 𝐴) ↔ 𝑇 Or 𝒫 𝐴))
179, 16mpbid 222 1 ((𝐴𝑉𝑅 We 𝐴) → 𝑇 Or 𝒫 𝐴)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1482   ∈ wcel 1989  ∀wral 2911  ∃wrex 2912  Vcvv 3198  𝒫 cpw 4156  {csn 4175   class class class wbr 4651  {copab 4710   ↦ cmpt 4727   E cep 5026   Or wor 5032   We wwe 5070  ◡ccnv 5111   “ cima 5115  Ord word 5720  ‘cfv 5886   Isom wiso 5887  (class class class)co 6647  ωcom 7062  1𝑜c1o 7550  2𝑜c2o 7551   ↑𝑚 cmap 7854 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-rep 4769  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-ral 2916  df-rex 2917  df-reu 2918  df-rab 2920  df-v 3200  df-sbc 3434  df-csb 3532  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-pss 3588  df-nul 3914  df-if 4085  df-pw 4158  df-sn 4176  df-pr 4178  df-tp 4180  df-op 4182  df-uni 4435  df-iun 4520  df-br 4652  df-opab 4711  df-mpt 4728  df-tr 4751  df-id 5022  df-eprel 5027  df-po 5033  df-so 5034  df-fr 5071  df-we 5073  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-res 5124  df-ima 5125  df-ord 5724  df-on 5725  df-lim 5726  df-suc 5727  df-iota 5849  df-fun 5888  df-fn 5889  df-f 5890  df-f1 5891  df-fo 5892  df-f1o 5893  df-fv 5894  df-isom 5895  df-ov 6650  df-oprab 6651  df-mpt2 6652  df-om 7063  df-1st 7165  df-2nd 7166  df-1o 7557  df-2o 7558  df-map 7856 This theorem is referenced by:  aomclem1  37450
 Copyright terms: Public domain W3C validator