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

Theorem cantnflem1c 9727
Description: Lemma for cantnf 9733. (Contributed by Mario Carneiro, 4-Jun-2015.) (Revised by AV, 2-Jul-2019.) (Proof shortened by AV, 4-Apr-2020.)
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
cantnflem1c ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ (𝐺 supp ∅))
Distinct variable groups:   𝑢,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝐴,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑢   𝑢,𝐹,𝑤,𝑥,𝑦,𝑧   𝑆,𝑐,𝑢,𝑥,𝑦,𝑧   𝐺,𝑐,𝑢,𝑤,𝑥,𝑦,𝑧   𝑢,𝑂,𝑤,𝑥,𝑦,𝑧   𝜑,𝑢,𝑥,𝑦,𝑧   𝑢,𝑋,𝑤,𝑥,𝑦,𝑧   𝐹,𝑐   𝜑,𝑐
Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)   𝑂(𝑐)   𝑋(𝑐)

Proof of Theorem cantnflem1c
StepHypRef Expression
1 cantnfs.b . . 3 (𝜑𝐵 ∈ On)
21ad3antrrr 730 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝐵 ∈ On)
3 simplr 769 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥𝐵)
4 oemapval.g . . . . . 6 (𝜑𝐺𝑆)
5 cantnfs.s . . . . . . 7 𝑆 = dom (𝐴 CNF 𝐵)
6 cantnfs.a . . . . . . 7 (𝜑𝐴 ∈ On)
75, 6, 1cantnfs 9706 . . . . . 6 (𝜑 → (𝐺𝑆 ↔ (𝐺:𝐵𝐴𝐺 finSupp ∅)))
84, 7mpbid 232 . . . . 5 (𝜑 → (𝐺:𝐵𝐴𝐺 finSupp ∅))
98simpld 494 . . . 4 (𝜑𝐺:𝐵𝐴)
109ffnd 6737 . . 3 (𝜑𝐺 Fn 𝐵)
1110ad3antrrr 730 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝐺 Fn 𝐵)
12 oemapval.t . . . . . . 7 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
13 oemapval.f . . . . . . 7 (𝜑𝐹𝑆)
14 oemapvali.r . . . . . . 7 (𝜑𝐹𝑇𝐺)
15 oemapvali.x . . . . . . 7 𝑋 = {𝑐𝐵 ∣ (𝐹𝑐) ∈ (𝐺𝑐)}
16 cantnflem1.o . . . . . . 7 𝑂 = OrdIso( E , (𝐺 supp ∅))
175, 6, 1, 12, 13, 4, 14, 15, 16cantnflem1b 9726 . . . . . 6 ((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) → 𝑋 ⊆ (𝑂𝑢))
1817ad2antrr 726 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋 ⊆ (𝑂𝑢))
19 simprr 773 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝑂𝑢) ∈ 𝑥)
205, 6, 1, 12, 13, 4, 14, 15oemapvali 9724 . . . . . . . . 9 (𝜑 → (𝑋𝐵 ∧ (𝐹𝑋) ∈ (𝐺𝑋) ∧ ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤))))
2120simp1d 1143 . . . . . . . 8 (𝜑𝑋𝐵)
22 onelon 6409 . . . . . . . 8 ((𝐵 ∈ On ∧ 𝑋𝐵) → 𝑋 ∈ On)
231, 21, 22syl2anc 584 . . . . . . 7 (𝜑𝑋 ∈ On)
2423ad3antrrr 730 . . . . . 6 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋 ∈ On)
25 onss 7805 . . . . . . . . 9 (𝐵 ∈ On → 𝐵 ⊆ On)
261, 25syl 17 . . . . . . . 8 (𝜑𝐵 ⊆ On)
2726sselda 3983 . . . . . . 7 ((𝜑𝑥𝐵) → 𝑥 ∈ On)
2827ad4ant13 751 . . . . . 6 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ On)
29 ontr2 6431 . . . . . 6 ((𝑋 ∈ On ∧ 𝑥 ∈ On) → ((𝑋 ⊆ (𝑂𝑢) ∧ (𝑂𝑢) ∈ 𝑥) → 𝑋𝑥))
3024, 28, 29syl2anc 584 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → ((𝑋 ⊆ (𝑂𝑢) ∧ (𝑂𝑢) ∈ 𝑥) → 𝑋𝑥))
3118, 19, 30mp2and 699 . . . 4 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑋𝑥)
32 eleq2w 2825 . . . . . 6 (𝑤 = 𝑥 → (𝑋𝑤𝑋𝑥))
33 fveq2 6906 . . . . . . 7 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
34 fveq2 6906 . . . . . . 7 (𝑤 = 𝑥 → (𝐺𝑤) = (𝐺𝑥))
3533, 34eqeq12d 2753 . . . . . 6 (𝑤 = 𝑥 → ((𝐹𝑤) = (𝐺𝑤) ↔ (𝐹𝑥) = (𝐺𝑥)))
3632, 35imbi12d 344 . . . . 5 (𝑤 = 𝑥 → ((𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)) ↔ (𝑋𝑥 → (𝐹𝑥) = (𝐺𝑥))))
3720simp3d 1145 . . . . . 6 (𝜑 → ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)))
3837ad3antrrr 730 . . . . 5 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤)))
3936, 38, 3rspcdva 3623 . . . 4 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝑋𝑥 → (𝐹𝑥) = (𝐺𝑥)))
4031, 39mpd 15 . . 3 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐹𝑥) = (𝐺𝑥))
41 simprl 771 . . 3 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐹𝑥) ≠ ∅)
4240, 41eqnetrrd 3009 . 2 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → (𝐺𝑥) ≠ ∅)
43 fvn0elsupp 8205 . 2 (((𝐵 ∈ On ∧ 𝑥𝐵) ∧ (𝐺 Fn 𝐵 ∧ (𝐺𝑥) ≠ ∅)) → 𝑥 ∈ (𝐺 supp ∅))
442, 3, 11, 42, 43syl22anc 839 1 ((((𝜑 ∧ (suc 𝑢 ∈ dom 𝑂 ∧ (𝑂𝑋) ⊆ 𝑢)) ∧ 𝑥𝐵) ∧ ((𝐹𝑥) ≠ ∅ ∧ (𝑂𝑢) ∈ 𝑥)) → 𝑥 ∈ (𝐺 supp ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wne 2940  wral 3061  wrex 3070  {crab 3436  wss 3951  c0 4333   cuni 4907   class class class wbr 5143  {copab 5205   E cep 5583  ccnv 5684  dom cdm 5685  Oncon0 6384  suc csuc 6386   Fn wfn 6556  wf 6557  cfv 6561  (class class class)co 7431   supp csupp 8185   finSupp cfsupp 9401  OrdIsocoi 9549   CNF ccnf 9701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8015  df-supp 8186  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-seqom 8488  df-1o 8506  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-fsupp 9402  df-oi 9550  df-cnf 9702
This theorem is referenced by:  cantnflem1  9729
  Copyright terms: Public domain W3C validator