Theorem mnutrd 40690

Description: Minimal universes are transitive. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypotheses

Ref	Expression
mnutrd.1	⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
mnutrd.2	⊢ (𝜑 → 𝑈 ∈ 𝑀)

Assertion

Ref	Expression
mnutrd	⊢ (𝜑 → Tr 𝑈)

Distinct variable groups:   𝑈,𝑘,𝑚,𝑛,𝑟,𝑝,𝑙   𝑈,𝑞,𝑘,𝑚,𝑛,𝑝,𝑙

Allowed substitution hints:   𝜑(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝑀(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem mnutrd

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mnutrd.1	. . . . 5 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2		mnutrd.2	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
3	2	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑈 ∈ 𝑀)
4		simprr 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
5		simprl 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑦)
6	1, 3, 4, 5	mnutrcld 40689	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑈)
7	6	ex 415	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
8	7	alrimivv 1928	. 2 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
9		dftr2 5167	. 2 ⊢ (Tr 𝑈 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
10	8, 9	sylibr 236	1 ⊢ (𝜑 → Tr 𝑈)

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1534   = wceq 1536   ∈ wcel 2113  {cab 2798  ∀wral 3137  ∃wrex 3138   ⊆ wss 3929  𝒫 cpw 4532  ∪ cuni 4831  Tr wtr 5165

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-in 3936  df-ss 3945  df-pw 4534  df-sn 4561  df-uni 4832  df-tr 5166

This theorem is referenced by:  mnugrud  40694