MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cantnflem1b Structured version   Visualization version   GIF version

Theorem cantnflem1b 9724
Description: Lemma for cantnf 9731. (Contributed by Mario Carneiro, 4-Jun-2015.) (Revised by AV, 2-Jul-2019.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑 → 𝐴 ∈ On)
cantnfs.b (𝜑 → 𝐵 ∈ On)
oemapval.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
oemapval.f (𝜑 → 𝐹 ∈ 𝑆)
oemapval.g (𝜑 → 𝐺 ∈ 𝑆)
oemapvali.r (𝜑 → 𝐹𝑇𝐺)
oemapvali.x 𝑋 = ∪ {𝑐 ∈ 𝐵 ∣ (𝐹‘𝑐) ∈ (𝐺‘𝑐)}
cantnflem1.o 𝑂 = OrdIso( E , (𝐺 supp ∅))
Assertion
Ref Expression
cantnflem1b ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → 𝑋 ⊆ (𝑂‘𝑢))
Distinct variable groups:   𝑢,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝐴,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑢   𝑢,𝐹,𝑤,𝑥,𝑦,𝑧   𝑆,𝑐,𝑢,𝑥,𝑦,𝑧   𝐺,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑢,𝑂,𝑤,𝑥,𝑦,𝑧   𝜑,𝑢,𝑥,𝑦,𝑧   𝑢,𝑋,𝑤,𝑥,𝑦,𝑧   𝐹,𝑐   𝜑,𝑐
Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥, 𝑦, 𝑧, 𝑤)   𝑂(𝑐)   𝑋(𝑐)

Proof of Theorem cantnflem1b
StepHypRef Expression
1 simprr 785 . . . 4 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (◡𝑂‘𝑋) ⊆ 𝑢)
2 cantnflem1.o . . . . . . 7 𝑂 = OrdIso( E , (𝐺 supp ∅))
32oicl 9560 . . . . . 6 Ord dom 𝑂
4 ovexd 7486 . . . . . . . . . 10 (𝜑 → (𝐺 supp ∅) ∈ V)
5 cantnfs.s . . . . . . . . . . . 12 𝑆 = dom (𝐴 CNF 𝐵)
6 cantnfs.a . . . . . . . . . . . 12 (𝜑 → 𝐴 ∈ On)
7 cantnfs.b . . . . . . . . . . . 12 (𝜑 → 𝐵 ∈ On)
8 oemapval.g . . . . . . . . . . . 12 (𝜑 → 𝐺 ∈ 𝑆)
95, 6, 7, 2, 8cantnfcl 9705 . . . . . . . . . . 11 (𝜑 → ( E We (𝐺 supp ∅) ∧ dom 𝑂 ∈ ω))
109simpld 500 . . . . . . . . . 10 (𝜑 → E We (𝐺 supp ∅))
112oiiso 9568 . . . . . . . . . 10 (((𝐺 supp ∅) ∈ V ∧ E We (𝐺 supp ∅)) → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
124, 10, 11syl2anc 596 . . . . . . . . 9 (𝜑 → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
13 isof1o 7362 . . . . . . . . 9 (𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)) → 𝑂:dom 𝑂⟶1-1onto(𝐺 supp ∅))
1412, 13syl 18 . . . . . . . 8 (𝜑 → 𝑂:dom 𝑂⟶1-1onto(𝐺 supp ∅))
15 f1ocnv 6867 . . . . . . . 8 (𝑂:dom 𝑂⟶1-1onto(𝐺 supp ∅) → ◡𝑂:(𝐺 supp ∅)⟶1-1ontodom 𝑂)
16 f1of 6854 . . . . . . . 8 (◡𝑂:(𝐺 supp ∅)⟶1-1ontodom 𝑂 → ◡𝑂:(𝐺 supp ∅)⟶dom 𝑂)
1714, 15, 163syl 19 . . . . . . 7 (𝜑 → ◡𝑂:(𝐺 supp ∅)⟶dom 𝑂)
18 oemapval.t . . . . . . . 8 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
19 oemapval.f . . . . . . . 8 (𝜑 → 𝐹 ∈ 𝑆)
20 oemapvali.r . . . . . . . 8 (𝜑 → 𝐹𝑇𝐺)
21 oemapvali.x . . . . . . . 8 𝑋 = ∪ {𝑐 ∈ 𝐵 ∣ (𝐹‘𝑐) ∈ (𝐺‘𝑐)}
225, 6, 7, 18, 19, 8, 20, 21cantnflem1a 9723 . . . . . . 7 (𝜑 → 𝑋 ∈ (𝐺 supp ∅))
2317, 22ffvelcdmd 7117 . . . . . 6 (𝜑 → (◡𝑂‘𝑋) ∈ dom 𝑂)
24 ordelon 6412 . . . . . 6 ((Ord dom 𝑂 ∧ (◡𝑂‘𝑋) ∈ dom 𝑂) → (◡𝑂‘𝑋) ∈ On)
253, 23, 24sylancr 599 . . . . 5 (𝜑 → (◡𝑂‘𝑋) ∈ On)
263a1i 11 . . . . . . . 8 (𝜑 → Ord dom 𝑂)
27 ordelon 6412 . . . . . . . 8 ((Ord dom 𝑂 ∧ suc 𝑢 ∈ dom 𝑂) → suc 𝑢 ∈ On)
2826, 27sylan 592 . . . . . . 7 ((𝜑 ∧ suc 𝑢 ∈ dom 𝑂) → suc 𝑢 ∈ On)
29 onsucb 7862 . . . . . . 7 (𝑢 ∈ On ↔ suc 𝑢 ∈ On)
3028, 29sylibr 237 . . . . . 6 ((𝜑 ∧ suc 𝑢 ∈ dom 𝑂) → 𝑢 ∈ On)
3130adantrr 730 . . . . 5 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → 𝑢 ∈ On)
32 ontri1 6423 . . . . 5 (((◡𝑂‘𝑋) ∈ On ∧ 𝑢 ∈ On) → ((◡𝑂‘𝑋) ⊆ 𝑢 ↔ ¬ 𝑢 ∈ (◡𝑂‘𝑋)))
3325, 31, 32syl2an2r 698 . . . 4 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → ((◡𝑂‘𝑋) ⊆ 𝑢 ↔ ¬ 𝑢 ∈ (◡𝑂‘𝑋)))
341, 33mpbid 235 . . 3 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → ¬ 𝑢 ∈ (◡𝑂‘𝑋))
3512adantr 486 . . . . . 6 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
36 ordtr 6402 . . . . . . . 8 (Ord dom 𝑂 → Tr dom 𝑂)
373, 36mp1i 14 . . . . . . 7 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → Tr dom 𝑂)
38 simprl 783 . . . . . . 7 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → suc 𝑢 ∈ dom 𝑂)
39 trsuc 6478 . . . . . . 7 ((Tr dom 𝑂 ∧ suc 𝑢 ∈ dom 𝑂) → 𝑢 ∈ dom 𝑂)
4037, 38, 39syl2anc 596 . . . . . 6 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → 𝑢 ∈ dom 𝑂)
4123adantr 486 . . . . . 6 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (◡𝑂‘𝑋) ∈ dom 𝑂)
42 isorel 7365 . . . . . 6 ((𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)) ∧ (𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ∈ dom 𝑂)) → (𝑢 E (◡𝑂‘𝑋) ↔ (𝑂‘𝑢) E (𝑂‘(◡𝑂‘𝑋))))
4335, 40, 41, 42syl12anc 850 . . . . 5 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑢 E (◡𝑂‘𝑋) ↔ (𝑂‘𝑢) E (𝑂‘(◡𝑂‘𝑋))))
44 fvex 6929 . . . . . 6 (◡𝑂‘𝑋) ∈ V
4544epeli 5560 . . . . 5 (𝑢 E (◡𝑂‘𝑋) ↔ 𝑢 ∈ (◡𝑂‘𝑋))
46 fvex 6929 . . . . . 6 (𝑂‘(◡𝑂‘𝑋)) ∈ V
4746epeli 5560 . . . . 5 ((𝑂‘𝑢) E (𝑂‘(◡𝑂‘𝑋)) ↔ (𝑂‘𝑢) ∈ (𝑂‘(◡𝑂‘𝑋)))
4843, 45, 473bitr3g 316 . . . 4 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑢 ∈ (◡𝑂‘𝑋) ↔ (𝑂‘𝑢) ∈ (𝑂‘(◡𝑂‘𝑋))))
49 f1ocnvfv2 7316 . . . . . . 7 ((𝑂:dom 𝑂⟶1-1onto(𝐺 supp ∅) ∧ 𝑋 ∈ (𝐺 supp ∅)) → (𝑂‘(◡𝑂‘𝑋)) = 𝑋)
5014, 22, 49syl2anc 596 . . . . . 6 (𝜑 → (𝑂‘(◡𝑂‘𝑋)) = 𝑋)
5150adantr 486 . . . . 5 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑂‘(◡𝑂‘𝑋)) = 𝑋)
5251eleq2d 2850 . . . 4 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → ((𝑂‘𝑢) ∈ (𝑂‘(◡𝑂‘𝑋)) ↔ (𝑂‘𝑢) ∈ 𝑋))
5348, 52bitrd 282 . . 3 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑢 ∈ (◡𝑂‘𝑋) ↔ (𝑂‘𝑢) ∈ 𝑋))
5434, 53mtbid 327 . 2 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → ¬ (𝑂‘𝑢) ∈ 𝑋)
555, 6, 7, 18, 19, 8, 20, 21oemapvali 9722 . . . . 5 (𝜑 → (𝑋 ∈ 𝐵 ∧ (𝐹‘𝑋) ∈ (𝐺‘𝑋) ∧ ∀𝑤 ∈ 𝐵 (𝑋 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))
5655simp1d 1160 . . . 4 (𝜑 → 𝑋 ∈ 𝐵)
57 onelon 6413 . . . 4 ((𝐵 ∈ On ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ On)
587, 56, 57syl2anc 596 . . 3 (𝜑 → 𝑋 ∈ On)
59 suppssdm 8232 . . . . . . 7 (𝐺 supp ∅) ⊆ dom 𝐺
605, 6, 7cantnfs 9704 . . . . . . . . 9 (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
618, 60mpbid 235 . . . . . . . 8 (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
6261simpld 500 . . . . . . 7 (𝜑 → 𝐺:𝐵⟶𝐴)
6359, 62fssdm 6759 . . . . . 6 (𝜑 → (𝐺 supp ∅) ⊆ 𝐵)
6463adantr 486 . . . . 5 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝐺 supp ∅) ⊆ 𝐵)
652oif 9561 . . . . . . 7 𝑂:dom 𝑂⟶(𝐺 supp ∅)
6665ffvelcdmi 7115 . . . . . 6 (𝑢 ∈ dom 𝑂 → (𝑂‘𝑢) ∈ (𝐺 supp ∅))
6740, 66syl 18 . . . . 5 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑂‘𝑢) ∈ (𝐺 supp ∅))
6864, 67sseldd 3914 . . . 4 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑂‘𝑢) ∈ 𝐵)
69 onelon 6413 . . . 4 ((𝐵 ∈ On ∧ (𝑂‘𝑢) ∈ 𝐵) → (𝑂‘𝑢) ∈ On)
707, 68, 69syl2an2r 698 . . 3 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑂‘𝑢) ∈ On)
71 ontri1 6423 . . 3 ((𝑋 ∈ On ∧ (𝑂‘𝑢) ∈ On) → (𝑋 ⊆ (𝑂‘𝑢) ↔ ¬ (𝑂‘𝑢) ∈ 𝑋))
7258, 70, 71syl2an2r 698 . 2 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → (𝑋 ⊆ (𝑂‘𝑢) ↔ ¬ (𝑂‘𝑢) ∈ 𝑋))
7354, 72mpbird 260 1 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (◡𝑂‘𝑋) ⊆ 𝑢)) → 𝑋 ⊆ (𝑂‘𝑢))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ∪ cuni 4872   class class class wbr 5108  {copab 5173  Tr wtr 5218   E cep 5557   We wwe 5610  ◡ccnv 5657  dom cdm 5658  Ord word 6387  Oncon0 6388  suc csuc 6390  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566   Isom wiso 6567  (class class class)co 7451  ωcom 7911   supp csupp 8214   finSupp cfsupp 9391  OrdIsocoi 9540   CNF ccnf 9699
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-supp 8215  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496  df-1o 8514  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-fsupp 9392  df-oi 9541  df-cnf 9700
This theorem is used by:  cantnflem1c  9725
  Copyright terms: Public domain W3C validator