Users' Mathboxes Mathbox for Eric Schmidt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  modelaxreplem1 Structured version   Visualization version   GIF version

Theorem modelaxreplem1 45968
Description: Lemma for modelaxrep 45971. We show that 𝑀 is closed under taking subsets. (Contributed by Eric Schmidt, 29-Sep-2025.)
Hypotheses
Ref Expression
modelaxreplem.1 (𝜓 → 𝑥 ⊆ 𝑀)
modelaxreplem.2 (𝜓 → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀))
modelaxreplem.3 (𝜓 → ∅ ∈ 𝑀)
modelaxreplem.4 (𝜓 → 𝑥 ∈ 𝑀)
modelaxreplem1.5 𝐴 ⊆ 𝑥
Assertion
Ref Expression
modelaxreplem1 (𝜓 → 𝐴 ∈ 𝑀)
Distinct variable group:   𝑓,𝑀
Allowed substitution hints:   𝜓(𝑥, 𝑓)   𝐴(𝑥, 𝑓)   𝑀(𝑥)

Proof of Theorem modelaxreplem1
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 modelaxreplem.3 . . 3 (𝜓 → ∅ ∈ 𝑀)
2 eleq1 2848 . . 3 (𝐴 = ∅ → (𝐴 ∈ 𝑀 ↔ ∅ ∈ 𝑀))
31, 2syl5ibrcom 250 . 2 (𝜓 → (𝐴 = ∅ → 𝐴 ∈ 𝑀))
4 vex 3454 . . . . . 6 𝑥 ∈ V
5 modelaxreplem1.5 . . . . . 6 𝐴 ⊆ 𝑥
64, 5ssexi 5283 . . . . 5 𝐴 ∈ V
760sdom 9127 . . . 4 (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)
8 ssdomg 9027 . . . . . 6 (𝑥 ∈ V → (𝐴 ⊆ 𝑥 → 𝐴 ≼ 𝑥))
94, 5, 8mp2 9 . . . . 5 𝐴 ≼ 𝑥
10 fodomr 9147 . . . . 5 ((∅ ≺ 𝐴 ∧ 𝐴 ≼ 𝑥) → ∃𝑔 𝑔:𝑥–onto→𝐴)
119, 10mpan2 704 . . . 4 (∅ ≺ 𝐴 → ∃𝑔 𝑔:𝑥–onto→𝐴)
127, 11sylbir 238 . . 3 (𝐴 ≠ ∅ → ∃𝑔 𝑔:𝑥–onto→𝐴)
13 df-fo 6544 . . . . 5 (𝑔:𝑥–onto→𝐴 ↔ (𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴))
14 df-fn 6541 . . . . . . . 8 (𝑔 Fn 𝑥 ↔ (Fun 𝑔 ∧ dom 𝑔 = 𝑥))
15 modelaxreplem.4 . . . . . . . . . 10 (𝜓 → 𝑥 ∈ 𝑀)
16 eleq1 2848 . . . . . . . . . 10 (dom 𝑔 = 𝑥 → (dom 𝑔 ∈ 𝑀 ↔ 𝑥 ∈ 𝑀))
1715, 16syl5ibrcom 250 . . . . . . . . 9 (𝜓 → (dom 𝑔 = 𝑥 → dom 𝑔 ∈ 𝑀))
1817anim2d 624 . . . . . . . 8 (𝜓 → ((Fun 𝑔 ∧ dom 𝑔 = 𝑥) → (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀)))
1914, 18biimtrid 245 . . . . . . 7 (𝜓 → (𝑔 Fn 𝑥 → (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀)))
20 modelaxreplem.1 . . . . . . . . 9 (𝜓 → 𝑥 ⊆ 𝑀)
215, 20sstrid 3919 . . . . . . . 8 (𝜓 → 𝐴 ⊆ 𝑀)
22 sseq1 3933 . . . . . . . 8 (ran 𝑔 = 𝐴 → (ran 𝑔 ⊆ 𝑀 ↔ 𝐴 ⊆ 𝑀))
2321, 22syl5ibrcom 250 . . . . . . 7 (𝜓 → (ran 𝑔 = 𝐴 → ran 𝑔 ⊆ 𝑀))
24 df-3an 1105 . . . . . . . 8 ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀) ∧ ran 𝑔 ⊆ 𝑀))
25 modelaxreplem.2 . . . . . . . . 9 (𝜓 → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀))
26 funeq 6559 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (Fun 𝑓 ↔ Fun 𝑔))
27 dmeq 5884 . . . . . . . . . . . . 13 (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
2827eleq1d 2845 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (dom 𝑓 ∈ 𝑀 ↔ dom 𝑔 ∈ 𝑀))
29 rneq 5917 . . . . . . . . . . . . 13 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
3029sseq1d 3939 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (ran 𝑓 ⊆ 𝑀 ↔ ran 𝑔 ⊆ 𝑀))
3126, 28, 303anbi123d 1464 . . . . . . . . . . 11 (𝑓 = 𝑔 → ((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) ↔ (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀)))
3229eleq1d 2845 . . . . . . . . . . 11 (𝑓 = 𝑔 → (ran 𝑓 ∈ 𝑀 ↔ ran 𝑔 ∈ 𝑀))
3331, 32imbi12d 347 . . . . . . . . . 10 (𝑓 = 𝑔 → (((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)))
3433spvv 2020 . . . . . . . . 9 (∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) → ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
3525, 34syl 18 . . . . . . . 8 (𝜓 → ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
3624, 35biimtrrid 246 . . . . . . 7 (𝜓 → (((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀) ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
3719, 23, 36syl2and 620 . . . . . 6 (𝜓 → ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → ran 𝑔 ∈ 𝑀))
38 eleq1 2848 . . . . . . 7 (ran 𝑔 = 𝐴 → (ran 𝑔 ∈ 𝑀 ↔ 𝐴 ∈ 𝑀))
3938adantl 487 . . . . . 6 ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → (ran 𝑔 ∈ 𝑀 ↔ 𝐴 ∈ 𝑀))
4037, 39mpbidi 244 . . . . 5 (𝜓 → ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → 𝐴 ∈ 𝑀))
4113, 40biimtrid 245 . . . 4 (𝜓 → (𝑔:𝑥–onto→𝐴 → 𝐴 ∈ 𝑀))
4241exlimdv 1965 . . 3 (𝜓 → (∃𝑔 𝑔:𝑥–onto→𝐴 → 𝐴 ∈ 𝑀))
4312, 42syl5 35 . 2 (𝜓 → (𝐴 ≠ ∅ → 𝐴 ∈ 𝑀))
443, 43pm2.61dne 3041 1 (𝜓 → 𝐴 ∈ 𝑀)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450   ⊆ wss 3895  ∅c0 4278   class class class wbr 5102  dom cdm 5650  ran crn 5651  Fun wfun 6532   Fn wfn 6533  –onto→wfo 6536   ≼ cdom 8971   ≺ csdm 8972
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-en 8974  df-dom 8975  df-sdom 8976
This theorem is used by:  modelaxreplem2  45969
  Copyright terms: Public domain W3C validator