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

Theorem wunfi 10733
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 3959 . . . . . 6 (𝑥 = ∅ → (𝑥𝑈 ↔ ∅ ⊆ 𝑈))
4 eleq1 2850 . . . . . 6 (𝑥 = ∅ → (𝑥𝑈 ↔ ∅ ∈ 𝑈))
53, 4imbi12d 347 . . . . 5 (𝑥 = ∅ → ((𝑥𝑈𝑥𝑈) ↔ (∅ ⊆ 𝑈 → ∅ ∈ 𝑈)))
65imbi2d 343 . . . 4 (𝑥 = ∅ → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (∅ ⊆ 𝑈 → ∅ ∈ 𝑈))))
7 sseq1 3959 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑈𝑦𝑈))
8 eleq1 2850 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑈𝑦𝑈))
97, 8imbi12d 347 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝑈𝑥𝑈) ↔ (𝑦𝑈𝑦𝑈)))
109imbi2d 343 . . . 4 (𝑥 = 𝑦 → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (𝑦𝑈𝑦𝑈))))
11 sseq1 3959 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥𝑈 ↔ (𝑦 ∪ {𝑧}) ⊆ 𝑈))
12 eleq1 2850 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥𝑈 ↔ (𝑦 ∪ {𝑧}) ∈ 𝑈))
1311, 12imbi12d 347 . . . . 5 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝑥𝑈𝑥𝑈) ↔ ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
1413imbi2d 343 . . . 4 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈))))
15 sseq1 3959 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑈𝐴𝑈))
16 eleq1 2850 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑈𝐴𝑈))
1715, 16imbi12d 347 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝑈𝑥𝑈) ↔ (𝐴𝑈𝐴𝑈)))
1817imbi2d 343 . . . 4 (𝑥 = 𝐴 → ((𝜑 → (𝑥𝑈𝑥𝑈)) ↔ (𝜑 → (𝐴𝑈𝐴𝑈))))
19 wun0.1 . . . . . 6 (𝜑𝑈 ∈ WUni)
2019wun0 10730 . . . . 5 (𝜑 → ∅ ∈ 𝑈)
2120a1d 26 . . . 4 (𝜑 → (∅ ⊆ 𝑈 → ∅ ∈ 𝑈))
22 ssun1 4127 . . . . . . . . 9 𝑦 ⊆ (𝑦 ∪ {𝑧})
23 sstr 3942 . . . . . . . . 9 ((𝑦 ⊆ (𝑦 ∪ {𝑧}) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑈) → 𝑦𝑈)
2422, 23mpan 703 . . . . . . . 8 ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)
2524imim1i 64 . . . . . . 7 ((𝑦𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈))
2619adantr 486 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑈 ∈ WUni)
27 simprr 785 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑦𝑈)
28 simprl 783 . . . . . . . . . . . . 13 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → (𝑦 ∪ {𝑧}) ⊆ 𝑈)
2928unssbd 4143 . . . . . . . . . . . 12 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → {𝑧} ⊆ 𝑈)
30 vex 3457 . . . . . . . . . . . . 13 𝑧 ∈ V
3130snss 4748 . . . . . . . . . . . 12 (𝑧𝑈 ↔ {𝑧} ⊆ 𝑈)
3229, 31sylibr 237 . . . . . . . . . . 11 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → 𝑧𝑈)
3326, 32wunsn 10728 . . . . . . . . . 10 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → {𝑧} ∈ 𝑈)
3426, 27, 33wunun 10722 . . . . . . . . 9 ((𝜑 ∧ ((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈)) → (𝑦 ∪ {𝑧}) ∈ 𝑈)
3534exp32 426 . . . . . . . 8 (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3635a2d 30 . . . . . . 7 (𝜑 → (((𝑦 ∪ {𝑧}) ⊆ 𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3725, 36syl5 35 . . . . . 6 (𝜑 → ((𝑦𝑈𝑦𝑈) → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3837a2i 15 . . . . 5 ((𝜑 → (𝑦𝑈𝑦𝑈)) → (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈)))
3938a1i 11 . . . 4 (𝑦 ∈ Fin → ((𝜑 → (𝑦𝑈𝑦𝑈)) → (𝜑 → ((𝑦 ∪ {𝑧}) ⊆ 𝑈 → (𝑦 ∪ {𝑧}) ∈ 𝑈))))
406, 10, 14, 18, 21, 39findcard2 9162 . . 3 (𝐴 ∈ Fin → (𝜑 → (𝐴𝑈𝐴𝑈)))
412, 40mpcom 39 . 2 (𝜑 → (𝐴𝑈𝐴𝑈))
421, 41mpd 16 1 (𝜑𝐴𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  cun 3900  wss 3902  c0 4282  {csn 4587  Fincfn 8955  WUnicwun 10712
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7866  df-en 8956  df-fin 8959  df-wun 10714
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator