Theorem modelaxreplem1 46161

Description: Lemma for modelaxrep 46164. 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.

Step	Hyp	Ref	Expression
1		modelaxreplem.3	. . 3 ⊢ (𝜓 → ∅ ∈ 𝑀)
2		eleq1 2852	. . 3 ⊢ (𝐴 = ∅ → (𝐴 ∈ 𝑀 ↔ ∅ ∈ 𝑀))
3	1, 2	syl5ibrcom 250	. 2 ⊢ (𝜓 → (𝐴 = ∅ → 𝐴 ∈ 𝑀))
4		vex 3458	. . . . . 6 ⊢ 𝑥 ∈ V
5		modelaxreplem1.5	. . . . . 6 ⊢ 𝐴 ⊆ 𝑥
6	4, 5	ssexi 5288	. . . . 5 ⊢ 𝐴 ∈ V
7	6	0sdom 9152	. . . 4 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)
8		ssdomg 9052	. . . . . 6 ⊢ (𝑥 ∈ V → (𝐴 ⊆ 𝑥 → 𝐴 ≼ 𝑥))
9	4, 5, 8	mp2 9	. . . . 5 ⊢ 𝐴 ≼ 𝑥
10		fodomr 9172	. . . . 5 ⊢ ((∅ ≺ 𝐴 ∧ 𝐴 ≼ 𝑥) → ∃𝑔 𝑔:𝑥⟶onto𝐴)
11	9, 10	mpan2 704	. . . 4 ⊢ (∅ ≺ 𝐴 → ∃𝑔 𝑔:𝑥⟶onto𝐴)
12	7, 11	sylbir 238	. . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑔 𝑔:𝑥⟶onto𝐴)
13		df-fo 6561	. . . . 5 ⊢ (𝑔:𝑥⟶onto𝐴 ↔ (𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴))
14		df-fn 6558	. . . . . . . 8 ⊢ (𝑔 Fn 𝑥 ↔ (Fun 𝑔 ∧ dom 𝑔 = 𝑥))
15		modelaxreplem.4	. . . . . . . . . 10 ⊢ (𝜓 → 𝑥 ∈ 𝑀)
16		eleq1 2852	. . . . . . . . . 10 ⊢ (dom 𝑔 = 𝑥 → (dom 𝑔 ∈ 𝑀 ↔ 𝑥 ∈ 𝑀))
17	15, 16	syl5ibrcom 250	. . . . . . . . 9 ⊢ (𝜓 → (dom 𝑔 = 𝑥 → dom 𝑔 ∈ 𝑀))
18	17	anim2d 624	. . . . . . . 8 ⊢ (𝜓 → ((Fun 𝑔 ∧ dom 𝑔 = 𝑥) → (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀)))
19	14, 18	biimtrid 245	. . . . . . 7 ⊢ (𝜓 → (𝑔 Fn 𝑥 → (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀)))
20		modelaxreplem.1	. . . . . . . . 9 ⊢ (𝜓 → 𝑥 ⊆ 𝑀)
21	5, 20	sstrid 3924	. . . . . . . 8 ⊢ (𝜓 → 𝐴 ⊆ 𝑀)
22		sseq1 3938	. . . . . . . 8 ⊢ (ran 𝑔 = 𝐴 → (ran 𝑔 ⊆ 𝑀 ↔ 𝐴 ⊆ 𝑀))
23	21, 22	syl5ibrcom 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 6576	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (Fun 𝑓 ↔ Fun 𝑔))
27		dmeq 5891	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
28	27	eleq1d 2849	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (dom 𝑓 ∈ 𝑀 ↔ dom 𝑔 ∈ 𝑀))
29		rneq 5924	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
30	29	sseq1d 3944	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (ran 𝑓 ⊆ 𝑀 ↔ ran 𝑔 ⊆ 𝑀))
31	26, 28, 30	3anbi123d 1465	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) ↔ (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀)))
32	29	eleq1d 2849	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (ran 𝑓 ∈ 𝑀 ↔ ran 𝑔 ∈ 𝑀))
33	31, 32	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)))
34	33	spvv 2023	. . . . . . . . 9 ⊢ (∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) → ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
35	25, 34	syl 18	. . . . . . . 8 ⊢ (𝜓 → ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
36	24, 35	biimtrrid 246	. . . . . . 7 ⊢ (𝜓 → (((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀) ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
37	19, 23, 36	syl2and 620	. . . . . 6 ⊢ (𝜓 → ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → ran 𝑔 ∈ 𝑀))
38		eleq1 2852	. . . . . . 7 ⊢ (ran 𝑔 = 𝐴 → (ran 𝑔 ∈ 𝑀 ↔ 𝐴 ∈ 𝑀))
39	38	adantl 487	. . . . . 6 ⊢ ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → (ran 𝑔 ∈ 𝑀 ↔ 𝐴 ∈ 𝑀))
40	37, 39	mpbidi 244	. . . . 5 ⊢ (𝜓 → ((𝑔 Fn 𝑥 ∧ ran 𝑔 = 𝐴) → 𝐴 ∈ 𝑀))
41	13, 40	biimtrid 245	. . . 4 ⊢ (𝜓 → (𝑔:𝑥⟶onto𝐴 → 𝐴 ∈ 𝑀))
42	41	exlimdv 1968	. . 3 ⊢ (𝜓 → (∃𝑔 𝑔:𝑥⟶onto𝐴 → 𝐴 ∈ 𝑀))
43	12, 42	syl5 35	. 2 ⊢ (𝜓 → (𝐴 ≠ ∅ → 𝐴 ∈ 𝑀))
44	3, 43	pm2.61dne 3045	1 ⊢ (𝜓 → 𝐴 ∈ 𝑀)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   class class class wbr 5106  dom cdm 5655  ran crn 5656  Fun wfun 6549   Fn wfn 6550  ⟶ontowfo 6553   ≼ cdom 8996   ≺ csdm 8997

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-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3417  df-v 3456  df-ss 3901  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-en 8999  df-dom 9000  df-sdom 9001

This theorem is used by:  modelaxreplem2  46162