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

Theorem wunfi 10735
Description: A weak universe contains all finite sets with elements drawn from the universe. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
wun0.1 (𝜑𝑈 ∈ WUni)
wunfi.2 (𝜑𝐴𝑈)
wunfi.3 (𝜑𝐴 ∈ Fin)
Assertion
Ref Expression
wunfi (𝜑𝐴𝑈)

Proof of Theorem wunfi
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wunfi.2 . 2 (𝜑𝐴𝑈)
2 wunfi.3 . . 3 (𝜑𝐴 ∈ Fin)
3 sseq1 3984 . . . . . 6 (𝑥 = ∅ → (𝑥𝑈 ↔ ∅ ⊆ 𝑈))
4 eleq1 2822 . . . . . 6 (𝑥 = ∅ → (𝑥𝑈 ↔ ∅ ∈ 𝑈))
53, 4imbi12d 344 . . . . 5 (𝑥 = ∅ → ((𝑥𝑈𝑥𝑈) ↔ (∅ ⊆ 𝑈 → ∅ ∈ 𝑈)))
65imbi2d 340 . . . 4 (𝑥 = ∅ → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (∅ ⊆ 𝑈 → ∅ ∈ 𝑈))))
7 sseq1 3984 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑈𝑦𝑈))
8 eleq1 2822 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑈𝑦𝑈))
97, 8imbi12d 344 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝑈𝑥𝑈) ↔ (𝑦𝑈𝑦𝑈)))
109imbi2d 340 . . . 4 (𝑥 = 𝑦 → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (𝑦𝑈𝑦𝑈))))
11 sseq1 3984 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥𝑈 ↔ (𝑦 ∪ {𝑧}) ⊆ 𝑈))
12 eleq1 2822 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥𝑈 ↔ (𝑦 ∪ {𝑧}) ∈ 𝑈))
1311, 12imbi12d 344 . . . . 5 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝑥𝑈𝑥𝑈) ↔ ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
1413imbi2d 340 . . . 4 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈))))
15 sseq1 3984 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑈𝐴𝑈))
16 eleq1 2822 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑈𝐴𝑈))
1715, 16imbi12d 344 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝑈𝑥𝑈) ↔ (𝐴𝑈𝐴𝑈)))
1817imbi2d 340 . . . 4 (𝑥 = 𝐴 → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (𝐴𝑈𝐴𝑈))))
19 wun0.1 . . . . . 6 (𝜑𝑈 ∈ WUni)
2019wun0 10732 . . . . 5 (𝜑 → ∅ ∈ 𝑈)
2120a1d 25 . . . 4 (𝜑 → (∅ ⊆ 𝑈 → ∅ ∈ 𝑈))
22 ssun1 4153 . . . . . . . . 9 𝑦 ⊆ (𝑦 ∪ {𝑧})
23 sstr 3967 . . . . . . . . 9 ((𝑦 ⊆ (𝑦 ∪ {𝑧}) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑈) → 𝑦𝑈)
2422, 23mpan 690 . . . . . . . 8 ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)
2524imim1i 63 . . . . . . 7 ((𝑦𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈))
2619adantr 480 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑈 ∈ WUni)
27 simprr 772 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑦𝑈)
28 simprl 770 . . . . . . . . . . . . 13 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → (𝑦 ∪ {𝑧}) ⊆ 𝑈)
2928unssbd 4169 . . . . . . . . . . . 12 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → {𝑧} ⊆ 𝑈)
30 vex 3463 . . . . . . . . . . . . 13 𝑧 ∈ V
3130snss 4761 . . . . . . . . . . . 12 (𝑧𝑈 ↔ {𝑧} ⊆ 𝑈)
3229, 31sylibr 234 . . . . . . . . . . 11 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑧𝑈)
3326, 32wunsn 10730 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → {𝑧} ∈ 𝑈)
3426, 27, 33wunun 10724 . . . . . . . . 9 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → (𝑦 ∪ {𝑧}) ∈ 𝑈)
3534exp32 420 . . . . . . . 8 (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3635a2d 29 . . . . . . 7 (𝜑 → (((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3725, 36syl5 34 . . . . . 6 (𝜑 → ((𝑦𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3837a2i 14 . . . . 5 ((𝜑 → (𝑦𝑈𝑦𝑈)) → (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3938a1i 11 . . . 4 (𝑦 ∈ Fin → ((𝜑 → (𝑦𝑈𝑦𝑈)) → (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈))))
406, 10, 14, 18, 21, 39findcard2 9178 . . 3 (𝐴 ∈ Fin → (𝜑 → (𝐴𝑈𝐴𝑈)))
412, 40mpcom 38 . 2 (𝜑 → (𝐴𝑈𝐴𝑈))
421, 41mpd 15 1 (𝜑𝐴𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  cun 3924  wss 3926  c0 4308  {csn 4601  Fincfn 8959  WUnicwun 10714
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 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-om 7862  df-en 8960  df-fin 8963  df-wun 10716
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator