Theorem 1strwunbndx 17403

Description: A constructed one-slot structure in a weak universe containing the index of the base set extractor. (Contributed by AV, 27-Mar-2020.)

Hypotheses

Ref	Expression
1str.g	⊢ 𝐺 = {⟨(Base‘ndx), 𝐵⟩}
1strwun.u	⊢ (𝜑 → 𝑈 ∈ WUni)
1strwunbndx.b	⊢ (𝜑 → (Base‘ndx) ∈ 𝑈)

Assertion

Ref	Expression
1strwunbndx	⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐺 ∈ 𝑈)

Proof of Theorem 1strwunbndx

Step	Hyp	Ref	Expression
1		1str.g	. 2 ⊢ 𝐺 = {⟨(Base‘ndx), 𝐵⟩}
2		1strwun.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ WUni)
3	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝑈 ∈ WUni)
4		1strwunbndx.b	. . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈)
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → (Base‘ndx) ∈ 𝑈)
6		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐵 ∈ 𝑈)
7	3, 5, 6	wunop 10807	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → ⟨(Base‘ndx), 𝐵⟩ ∈ 𝑈)
8	3, 7	wunsn 10801	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → {⟨(Base‘ndx), 𝐵⟩} ∈ 𝑈)
9	1, 8	eqeltrid 2864	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐺 ∈ 𝑈)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {csn 4583  ⟨cop 4589  ‘cfv 6538  WUnicwun 10785  ndxcnx 17371  Basecbs 17387

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-ext 2732

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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-tr 5212  df-wun 10787

This theorem is used by:  1strwun  17404  equivestrcsetc  18326